Evaluation Measures for Ontology Matchers in Supervised Matching Scenarios

نویسندگان

  • Dominique Ritze
  • Heiko Paulheim
  • Kai Eckert
چکیده

Precision and Recall, as well as their combination in terms of FMeasure, are widely used measures in computer science and generally applied to evaluate the overall performance of ontology matchers in fully automatic, unsupervised scenarios. In this paper, we investigate the case of supervised matching, where automatically created ontology alignments are verified by an expert. We motivate and describe this use case and its characteristics and discuss why traditional, F-measure based evaluation measures are not suitable for this use case. Therefore, we investigate several alternative evaluation measures and propose the use of Precision@N curves as a mean to assess different matching systems for supervised matching. We compare the ranking of several state of the art matchers using Precision@N curves to the traditional F-measure based ranking, and discuss means to combine matchers in a way that optimizes the user support in supervised ontology matching.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Openknowledge Deliverable 3.3.: a Methodology for Ontology Matching Quality Evaluation

This document presents an evaluation methodology for the assessment of quality results produced by ontology matchers. In particular, it discusses: (i) several standard quality measures used in the ontology matching evaluation, (ii) a methodology of how to build semiautomatically an incomplete reference alignment allowing for the assessment of quality results produced by ontology matchers and (i...

متن کامل

Towards combining ontology matchers via anomaly detection

In ontology alignment, there is no single best performing matching algorithm for every matching problem. Thus, most modern matching systems combine several base matchers and aggregate their results into a final alignment. This combination is often based on simple voting or averaging, or uses existing matching problems for learning a combination policy in a supervised setting. In this paper, we ...

متن کامل

Evaluating Ontology Matchers Using Arbitrary Ontologies and Human Generated Heterogeneities

Automatic ontology matching is a hard problem. To address this problem many ontology matchers have evolved in the past several years. Consequently the evaluation of ontology matchers has become crucial in order to help improve a matcher’s performance. The evaluation frameworks used so far are limited to available pairs of ontologies in certain domains and require the reference alignments (i.e.,...

متن کامل

Adding a Pre processing Phase to ASMOV for Improving the Alignment Result

Ontology matching is one of the most important challenges in the semantic web. It is a technique which is used to find the semantic correspondences between entities which are modeled in different ontologies. Despite many research efforts in ontology matching, the matching process still suffers from severe problems with respect to the quality of the matching results. Furthermore, finding the cor...

متن کامل

A Semi-supervised Learning Approach for Ontology Matching

Ontology matching is the task of finding correspondences between semantically related entities in different ontologies, which is a key solution to the semantic heterogeneity problem. Recently, several supervised learning approaches for ontology matching have been proposed, which outperform traditional unsupervised approaches. The existing learning based approaches treat the similarity values of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013